Nonstandard arithmetic and recursive comprehension
نویسندگان
چکیده
منابع مشابه
Nonstandard arithmetic and recursive comprehension
First order reasoning about hyperintegers can prove things about sets of integers. In the author’s paper Nonstandard Arithmetic and Reverse Mathematics, Bulletin of Symbolic Logic 12 (2006), it was shown that each of the “big five” theories in reverse mathematics, including the base theory RCA0, has a natural nonstandard counterpart. But the counterpart RCA0 of RCA0 has a defect: it does not im...
متن کاملNonstandard arithmetic and reverse mathematics
We show that each of the five basic theories of second order arithmetic that play a central role in reverse mathematics has a natural counterpart in the language of nonstandard arithmetic. In the earlier paper [HKK1984] we introduced saturation principles in nonstandard arithmetic which are equivalent in strength to strong choice axioms in second order arithmetic. This paper studies principles ...
متن کاملArithmetic Nullstellensatz and Nonstandard Methods
In this study we find height bounds for polynomial rings over integral domains. We apply nonstandard methods and hence our constants will be ineffective. Furthermore we consider unique factorization domains and possible bounds for valuation rings and arithmetical functions.
متن کاملWeak Theories of Nonstandard Arithmetic and Analysis
A general method of interpreting weak higher-type theories of nonstandard arithmetic in their standard counterparts is presented. In particular, this provides natural nonstandard conservative extensions of primitive recursive arithmetic, elementary recursive arithmetic, and polynomial-time computable arithmetic. A means of formalizing basic real analysis in such theories is sketched. §
متن کاملFinite Models of Eleimentaxy Recursive Nonstandard Analysis
This paper provides a new proof of the consistency of the formal system presented by Chuaqui and Suppes in [2, 9). First, a simpler, yet stronger, system, called Elementary Recursive Nonstandard Analysis, ERNA, will be provided. Indeed, it will be shown that ERNA proves all of the theorems of the Chuaqui and Suppes system. Then a finitary consistency proof of ERNA dl be given; in particular, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2010
ISSN: 0168-0072
DOI: 10.1016/j.apal.2010.01.001